On the stability and convergence of a sliding-window variable-regularization recursive-least-squares algorithm
نویسندگان
چکیده
A sliding-window variable-regularization recursive-least-squares algorithm is derived, and its convergence properties, computational complexity, and numerical stability are analyzed. The algorithm operates on a finite data window and allows for time-varying regularization in the weighting and the difference between estimates. Numerical examples are provided to compare the performance of this technique with the least mean squares and affine projection algorithms. Copyright © 2015 John Wiley & Sons, Ltd.
منابع مشابه
A novel variable-length sliding window blockwise least-squares algorithm for on-line estimation of time-varying parameters
Motivated by the advances in computer technology and the fact that the batch/block least-squares (LS) produces more accurate parameter estimates than its recursive counterparts, several important issues associated with the block LS have been re-examined in the framework of on-line identification of systems with abrupt/gradual change parameters in this paper. It is no surprise that the standard ...
متن کاملA New Variable Regularized QR Decom- position-Based Recursive Least M-Esti- mate Algorithm—Performance Analysis and Acoustic Applications
This paper proposes a new variable regularized QR decomposition (QRD)-based recursive least M-estimate (VR-QRRLM) adaptive filter and studies its convergence performance and acoustic applications. Firstly, variable regularization is introduced to an efficient QRD-based implementation of the conventional RLM algorithm to reduce its variance and improve the numerical stability. Difference equatio...
متن کاملThe multichannel Gauss-Seidel fast affine projection algorithm for active noise control
It is well known that fast affine projection algorithms can produce a good trade-off between convergence speed and computational complexity. Recently, a multichannel fast affine projection algorithm was introduced for active noise control, using a sliding window recursive leastsquares algorithm inside the affine projection algorithm. It was reported that not only can this algorithm provide the ...
متن کاملKernel Recursive Least-Squares Temporal Difference Algorithms with Sparsification and Regularization
By combining with sparse kernel methods, least-squares temporal difference (LSTD) algorithms can construct the feature dictionary automatically and obtain a better generalization ability. However, the previous kernel-based LSTD algorithms do not consider regularization and their sparsification processes are batch or offline, which hinder their widespread applications in online learning problems...
متن کاملA Sliding Window RLS - like Adaptive Algorithm for Filtering - stable NoiseMurat
We introduce a sliding window adaptive RLS-like algorithm for ltering-stable noise. Unless previously introduced stochastic gradient type algorithms, the new adaptation algorithm minimizes the L p norm of the error exactly in a sliding window of xed size. Therefore, it behaves much like the RLS algorithm in terms of convergence speed and computational complexity compared to previously introduce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015